منابع مشابه
Inverse scheduling: two-machine flow-shop problem
We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملTwo-Machine Flow-Shop Scheduling with Job Delivery Coordination
This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept...
متن کاملTwo-Machine Fuzzy Flow Shop Scheduling Using Black Hole Algorithm
Flow shop scheduling of jobs has always been a popular problem that has found solutions in the number of heuristic and meta-heuristic techniques. In this manuscript, two-machine flow shop scheduling problem has been investigated while optimizing makespan and idle time of machines. Uncertainties in the processing time and set up times of jobs involved are also taken into consideration in the for...
متن کاملTwo Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds
The paper considers a two machine flow shop scheduling problem with no wait in process. The objective is to find the optimal values of machine speeds and to determine the time-optimal schedule. There are two machines, A and B, and a set of n jobs each consisting of two operations. The first operation of each job is to be processed on machine A and the second on machine B. For each feasible sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2014
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-014-0055-x